Finding optimal hardware/software partitions
نویسندگان
چکیده
منابع مشابه
Finding optimal hardware/software partitions
Most previous approaches to hardware/software partitioning considered heuristic solutions. In contrast, this paper presents an exact algorithm for the problem based on branch-and-bound. Several techniques are investigated to speed up the algorithm, including bounds based on linear programming, a custom inference engine to make the most out of the inferred information, advanced necessary conditi...
متن کاملTowards Finding Optimal Partitions of Categorical Datasets
A considerable amount of work has been dedicated to clustering numerical data sets, but only a handful of categorical clustering algorithms are reported to date. Furthermore, almost none has addressed the following two important cluster validity problems: (1) Given a data set and a clustering algorithm that partitions the data set into k clusters, how can we determine the best k with respect to...
متن کاملFinding Skew Partitions Efficiently
A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A B C D such that there are all possible edges between A and B and no edges between C and D. We present a polynomial-time algorithm for testing whether a graph admits a skew partition. Our algorithm solves the more general list skew partition problem, where the input contains, for each ve...
متن کاملFinding H-partitions efficiently
We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more gen...
متن کاملOn Optimal Guillotine Partitions Approximating Optimal D-box Partitions
Given a set of n points, P, in E d (the plane when d = 2) that lie inside a d-box (rectangle when d = 2) R, we study the problem of partitioning R into d-boxes by introducing a set of orthogonal hyperplane segments (line segments when d = 2) whose total (d?1)-volume (length when d = 2) is the least possible. In a valid d-box partition, each point in P must be included in at least one partitioni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2007
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-007-0039-0